Search results for "Internet routing protocols"

Updating the OSPF routing protocol for communication networks by optimal decision-making over the k-shortest path algorithm

2019

Internet routing protocols such as Routing Information Protocol (RIP) pre-compute all the shortest paths by Dijkstra's algorithm (shortest path first, SPF) based on the number of hops between one node and another. Every time any communication is intended, RIP looks-up for the optimal choice in a routing table. This is a high speed method in the decision-making process but not necessary fast for data traffic as it does not take into account any real-time measure of route congestion. Open Shortest Path First (OSPF) presents a dynamic version of this problem by computing the shortest paths taking into account network features such as bandwidth, delay and load. OSPF thereby maintains link-state…